Implicit level set algorithms for modelling hydraulic fracture propagation
نویسندگان
چکیده
منابع مشابه
Hydraulic fracture propagation: analytical solutions versus Lattice simulations
In this work, we used a grain-based numerical model based on the concept of lattice. The modelling was done to simulate the lab experiments carried out on the mortar samples. Also the analytical solutions corresponding to the viscosity-dominated regime were used to estimate the fracture length and width, and the results obtained were compared with the numerical simulations. As the analytical so...
متن کاملHydraulic Fracture Propagation near a Natural Discontinuity
The trajectory of a hydraulically driven crack near natural fractures, faults, and inhomogeneities has been studied using the complex variable hypersingular boundary element technique. The crack trajectories are presented for the cases of an oblique and a steeply inclined fault. It has been demonstrated that natural fractures, faults, and other inhomogeneities generate unstable fracture conÞgur...
متن کاملNumerical Analysis on the Stability of Hydraulic Fracture Propagation
The formation of dense spacing fracture network is crucial to the hydraulic fracturing treatment of unconventional reservoir. However, one difficulty for fracturing treatment is the lack of clear understanding on the nature of fracture complexity created during the treatment. In this paper, fracture propagation is numerically investigated to find the conditions needed for the stable propagation...
متن کاملHydraulic fracture modelling with double node zero-thickness interface elements
In recent years, numerical modelling of hydraulic fracture has become a hot topic in Petroleum Engineering. The main difficulty is related to the numerical treatment of discontinuities in a geological medium. Several approaches can be found in the literature (Boone and Ingraffea, 1990; Adachi et al., 2007); however, some of them resort to simplifications that make them inapplicable in complex c...
متن کاملImplicit Hitting Set Algorithms for Reasoning Beyond NP
Lifting a recent proposal by Moreno-Centeno and Karp, we propose a general framework for so-called implicit hitting set algorithms for reasoning beyond NP. The framework is motivated by empirically successful specific instantiations of the approach—based on interactions between a Boolean satisfiability (SAT) solver and an integer programming (IP) solver—in the context of maximum satisfiability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2016
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2015.0423